Fast amortized multi-point evaluation

نویسندگان

چکیده

The efficient evaluation of multivariate polynomials at many points is an important operation for polynomial system solving. Kedlaya and Umans have recently devised a theoretically algorithm this task when the coefficients are integers or they lie in finite field. In paper, we assume that set where need to evaluate fixed “sufficiently generic”. Under these restrictions, present quasi-optimal multi-point over general fields. We also opposite interpolation task.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast indefinite multi-point (IMP) clustering

A new class of objective functions and an associated fast descent algorithm that generalizes the K-means algorithm is presented. The algorithm represents clusters as unions of Voronoi cells and an explicit, but efficient, combinatorial search phase enables the algorithm to escape many local minima with guaranteed descent. The objective function has explicit penalties for gaps between clusters. ...

متن کامل

Amortized Sublinear Secure Multi Party Computation

We study the problem of secure two-party and multi-party computation in a setting where some of the participating parties hold very large inputs. Such settings increasingly appear when participants wish to securely query a database server, a typical situation in cloud related applications. Classic results in secure computation require work that grows linearly with the size of the input, while i...

متن کامل

Amortized Noise

A new noise generation algorithm called amortized noise generates smooth noise using dynamic programming techniques to amortize the cost of floating point multiplications over neighboring points. The amortized 2D noise algorithm uses a factor of 17/3 ≈ 5.67 fewer floating point multiplications than the 2D Perlin noise algorithm, resulting in a speedup by a factor of 3 in practice on current des...

متن کامل

Amortized Analysis

In this lecture, we will cover amortized analysis, which is a method where we consider the average work done over an entire sequence of operations instead of just considering the worst-case cost/time for a single operation; by doing such an analysis, we can obtain tighter bounds in scenarios when expensive operations occur rarely enough that we can charge their cost to more frequent inexpensive...

متن کامل

Amortized Analysis

In general, the running time of an algorithm depends on the efficiency of the data structure that is used to implement it. The algorithm performs, among other things, a sequence of operations on the data structure. In such cases, we are interested in the total time for a sequence of operations. In general, the time to perform a single operation may fluctuate—some operations may be “cheap”, wher...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Complexity

سال: 2021

ISSN: ['1090-2708', '0885-064X']

DOI: https://doi.org/10.1016/j.jco.2021.101574